Application of Memetic Algorithm to Solve Truck and Trailer Routing Problems

Abstract Application of memetic algorithm (MA) is considered in this work to solve the truck and trailer routing problem (TTRP). In TTRP, some customers can be designated as vehicle customers and can be serviced either by a complete vehicle (a trailer pulling by truck) or a single truck. However, some customers are known as truck customers and have to be serviced by a single truck. To employ this algorithm, Partial-mapped crossover (PMX), various mutations and local search approaches have been applied and a truck and trailer routing problem has been solved. The results compared with the findings available in the literature. The MA used for this purpose obtained 13 best solutions out of 21, including 10 new solutions. The results obtained from the application of MA are better than other algorithms such as tabu search and simulated annealing. Therefore, application of MA is useful for solving TTRP.